Barrier elision for production parallel programs
نویسندگان
چکیده
منابع مشابه
Static Analysis of Barrier Synchronization in Explicitly Parallel Programs
Many coarse-grained, explicitly parallel programs execute in phases delimited by barriers to preserve sets of cross process data dependencies. One of the major obstacles to optimizing these programs is the necessity to conservatively assume that any two statements in the program may execute concurrently. Consequently, compilers fail to take advantage of opportunities to apply optimizing transfo...
متن کاملOrchestrating Production Computer Algebra Components into Portable Parallel Programs
This paper demonstrates that it is possible to obtain good, scalable parallel performance by coordinating multiple instances of unaltered sequential computational algebra systems in order to deliver a single parallel system. The paper presents the first substantial parallel performance results for SymGrid-Par, a system that orchestrates computational algebra components into a high-performance p...
متن کاملfaciliting lexical access for the fluent production of speech
the hypothesis is that recent and frequent exposure to lexical items leads to a more fluent production of speech in terms of rate of speech. to test the hypothesis,a one-way anova experimental design was carried out. 24 sednior students of efl participated in a one-way interview test. data analyses revealed that those who were exposed frequently to the lexical items over a week prior to inter...
15 صفحه اولPessimistic Software Lock-Elision
Read-write locks are one of the most prevalent lock forms in concurrent applications because they allow read accesses to locked code to proceed in parallel. However, they do not offer any parallelism between reads and writes. This paper introduces pessimistic lock-elision (PLE), a new approach for nonspeculatively replacing read-write locks with pessimistic (i.e. non-aborting) software transact...
متن کاملExact Barrier Function Methods for Lipschitz Programs
The purposeof this paper is twofold. First we considera class of nondiierentiablepenaltyfunctions for constrained Lipschitz programs and then we show how these penalty functions can be employed to actually solve a constrained Lipschitz program. The penalty functions considered incorporate a barrier term which makes their value go to innnity on the boundary of a perturbation of the feasible set....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2015
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2858788.2688502